Optimal resource allocation and redistribution strategy in military conflicts with Lanchester square law attrition

We address the problem of optimal decision‐making in conflicts based on Lanchester square law attrition model where a defending force needs to be partitioned optimally, and allocated to two different attacking forces of differing strengths and capabilities. We consider a resource allocation scheme called the Time Zero Allocation with Redistribution (TZAR) strategy, where allocation is followed by redistribution of defending forces, on the occurrence of certain decisive events. Unlike previous work on Lanchester attrition model based tactical decision‐making, which propose time sequential tactics through an optimal control approach, the present article focuses on obtaining simpler resource allocation tactics based on a static optimization framework, and demonstrates that the results obtained are similar to those obtained by the more complex dynamic optimal control solution. Complete solution for this strategy is obtained for optimal partitioning of resources of the defending forces. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Equitable bandwidth allocation in content distribution networks

Applications for content distribution over networks, such as Video‐on‐Demand (VOD), are expected to grow significantly over time. Effective bandwidth allocation schemes that can be repeatedly executed must be deployed since new programs are often installed at various servers while other are deleted. We present a model for bandwidth allocation in a content distribution network that consists of multiple trees, where the root of each tree has a server that broadcasts multiple programs throughout the tree. Each network link has limited capacity and may be used by one or more of these trees. The model is formulated as an equitable resource allocation problem with a lexicographic maximin objective function that attempts to provide equitable service performance for all requested programs at the various nodes. The constraints include link capacity constraints and tree‐like ordering constraints imposed on each of the programs. We present an algorithm that provides an equitable solution in polynomial time for certain performance functions. At each iteration, the algorithm solves single‐link maximin optimization problems while relaxing the ordering constraints. The algorithm selects a bottleneck link, fixes various variables at their lexicographic optimal solution while enforcing the ordering constraints, and proceeds with the next iteration. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Democracy index for Africa, 2010

ABSTRACT

Natural resource-based conflicts continue to occur in different parts of Nigeria with negative implications. This study investigated the phenomena of natural resource conflicts vis-à-vis their propensities to impact political economy and national security negatively. Data for the study were sourced from theoretical and empirical evidence. Empirical data were sourced from existing studies selected on the basis on their relevance to the study and analysed based on their content. The limitation to this approach is the obsolete and subjective nature of some the literature. This limitation was, however, addressed among others through the author’s knowledge of the issues under study. The study found that Nigeria is enmeshed in conflict over ownership, distribution, access to or competition over natural resources such as petroleum resources and agricultural land and these conflicts have undermined democracy, human rights, the economy and the nation’s security. The paper identified poor resource governance, environmental factors and poor political leadership as the causes and drivers of these conflicts. It recommends natural resource governance among others, as a way out of the problem.     

车载多接入边缘网络中联合资源分配和动态任务卸载方案

针对车联网中车辆移动速度过快产生的任务卸载失败问题,设计了一个有效的任务卸载风险评估模型,并提出了联合资源分配的动态任务卸载方案。将时间、能耗和风险共同建模为系统效用,通过联合优化卸载决策、资源分配来最大化系统效用。优化问题被公式化为混合整数非线性规划,在给定卸载决策的情况下,利用凸优化技术解决计算资源分配问题,功率分配通过分式规划技术来优化。仿真分析了车辆移动性对系统效用的影响,证明了所提方案的合理性。     

Discrete search allocation game with false contacts

This paper deals with a two‐person zero‐sum game called a search allocation game, where a searcher and a target participate, taking account of false contacts. The searcher distributes his search effort in a search space in order to detect the target. On the other hand, the target moves to avoid the searcher. As a payoff of the game, we take the cumulative amount of search effort weighted by the target distribution, which can be derived as an approximation of the detection probability of the target. The searcher's strategy is a plan of distributing search effort and the target's is a movement represented by a path or transition probability across the search space. In the search, there are false contacts caused by environmental noises, signal processing noises, or real objects resembling true targets. If they happen, the searcher must take some time for their investigation, which interrupts the search for a while. There have been few researches dealing with search games with false contacts. In this paper, we formulate the game into a mathematical programming problem to obtain its equilibrium point. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Some probability functions in reliability and their applications

There has been much research on the general failure model recently. In the general failure model, when the unit fails at its age t, Type I failure (minor failure) occurs with probability 1 ? p(t) and Type II failure (catastrophic failure) occurs with probability p(t). In the previous research, some specific shapes (constant, non‐decreasing, or bathtub‐shape) on the probability function p(t) are assumed. In this article, general results on some probability functions are obtained and applied to study the shapes of p(t). The results are also applied to determining the optimal inspection and allocation policies in maintenance problems. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

基于STN的任务执行过程中的资源冲突自动消解

任务在执行过程中受到各种因素的影响,任务时间可能会偏离预定计划,在资源数量有限的情况下,由于要满足时间的约束,往往会出现时间重叠而发生资源冲突。消解这种资源冲突的一个最直接的方法是及时调整任务计划时间消解潜在的资源冲突。针对任务执行过程中冲突消解人工决策耗时较长的问题,设计了一种基于STN的任务在执行过程中的自动消解方法,通过案例仿真,证明方法是可行的,并且能够比人工决策方式节约时间。     

一种基于周期分区的时间调度算法

针对多功能相控阵雷达任务实时调度问题,提出了一种基于采样周期分区的时间资源调度算法(记为PD)。该算法以各类任务采样周期的最大公约数为分区标准,将各采样周期均分为多个等长区间,再将各类任务平均分配到不同分区中调度执行,可解决调度过程中任务因采样周期不同产生冲突的难题。仿真结果表明,该算法可提高系统任务调度能力,可广泛应用于相控阵雷达任务调度及其他实时任务调度系统。     

增强网络技术在教学中的辅助作用

网络技术在教育教学当中的应用是深化教育体制改革、扎实推进教育公平的重要措施,也是对适应我国教育教学活动实际的教学模式的研究和重要探索。分析了网络技术辅助教学相比传统教学所具有的优势,并从开发和应用两方面对网络辅助教学进行阐述,同时展望了网络技术的发展前景及其对未来教育的影响。     

装甲装备器材库存超(欠)储状态分析与程度评价

定义了装甲装备器材库存超(欠)储的概念,提出了维修保障资源点器材储存状态的定性判别和量化方法;考虑数量、时间、空间等影响因素,提出了资源点维修器材超(欠)储程度的评价指标和评价方法,并结合某军区实际数据进行了验证。结果表明:资源点的平均超(欠)储程度反映了保障体系内所有资源点库存偏离正常水平的平均程度,可为确定调剂资源点的优先次序和供应数量提供依据。